Bco-based Optimized Heuristic Strategies For Qos Routing
نویسندگان
چکیده
منابع مشابه
GA-Based Heuristic Algorithms for QoS Based Multicast Routing
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random...
متن کاملOptimized Delay Constrained QoS Routing
QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP-hard or complete and some algorithms have been proposed to find a near optim...
متن کاملHeuristic and Exact Algorithms for QoS Routing with Multiple Constraints ∗
The modern network service of finding the optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multiconstrained optimal-path (MCOP) QoS routing problem, which is NP-complete. In this paper, this problem is solved through both exact and heuristic algorithms. We propose an exact algorithm E MCOP, which first constructs...
متن کاملSmart Routing with Learning-Based QoS-Aware Meta-strategies
Conventional Quality of Service (QoS) routing cannot be applied easily to wireless ad-hoc sensor networks due to the unreliable and dynamic nature of such networks. For these networks, we have proposed a framework of Message-initiated Constraint-Based Routing (MCBR), which consists of a QoS speci cation and a set of QoS-aware metastrategies. In contrast to most existing ad-hoc routing with no Q...
متن کاملMulti-class QoS routing strategies based on the network state
Hedia Kochkar, Takeshi Ikenaga, Yuji Oie Department of Computer Science and Electronics, Kyushu Institute of Technology, 680-4 kawazu, Iizuka, Fukuoka 820-8502 Japan sharing, where network resources are dynamically shared between different service classes of traffic. For example, in [4], the authors study methods to improve the throughput of Best Effort traffic in a network on which resources ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Computer Science
سال: 2012
ISSN: 2008-949X
DOI: 10.22436/jmcs.05.02.05